The Meaning of Erasing in RDF under the Katsuno-Mendelzon Approach
نویسندگان
چکیده
The basic data model for the Semantic Web is RDF. In this paper we address updates in RDF. It is known that the semantics of updates for data models becomes unclear when the model turns, even slightly, more general than a simple relational structure. Using the framework of KatsunoMendelzon, we define a semantics for updates in RDF. Particularly we explore the behavior of this semantics for the “erase” operator (which in general is not expressible in RDF). Our results include a proposal of sound semantics for RDF updates, a characterization of the maximal RDF graph which captures exactly all consequences of the erase operation expressible in RDF, and complexity results about the computation of this graph and updates in RDF in general.
منابع مشابه
Updating Semantic Web Data
The basic data model for the Semantic Web is the Resource Description Framework (RDF). From a data management point of view, it resembles a lightweight knowledge base. In this paper we address updates in RDF. It is known that the semantics of updates for data models becomes unclear when the model turns, even slightly, more general than a simple relational structure. Viewing RDF as a knowledge b...
متن کاملOn Persistent Semantics for Knowledge
Katsuno and Mendelzon suggested eight postulates for characterizing the semantics of update where the principle of minimal change is embedded [Katsuno and Mendelzon, 1991a]. In this paper we propose a new method for knowledge base update based on persistence. We examine the relations between the two di erent update semantics by investigating the satis ability of Katsuno and Mendelzon's update p...
متن کاملUpdate Postulates without Inertia
Starting from Katsuno and Mendelzon postulates, a new set of postulates which is minimal and complete has been deened, these postulates characterize an update operator. The update operator class which is obtained is larger than Katsuno and Mendelzon's one, since it includes updating operators which are not inert, and which allow for the existence of unreachable states. The main property is that...
متن کاملContraction in Propositional Logic
The AGM model for the revision and contraction of belief sets provides rationality postulates for each of the two cases. In the context of finite propositional logic, Katsuno and Mendelzon pointed out postulates for the revision of belief bases which correspond to the AGM postulates for the revision of beliefs sets. In this paper, we present postulates for the contraction of propositional belie...
متن کامل